Towards Biresiduated Multi-adjoint Logic Programming
نویسندگان
چکیده
Multi-adjoint logic programs were recently proposed as a generalization of monotonic and residuated logic programs, in that simultaneous use of several implications in the rules and rather general connectives in the bodies are allowed. In this work, the need of biresiduated pairs is justified through the study of a very intuitive family of operators, which turn out to be not necessarily commutative and associative and, thus, might have two different residuated implications; finally, we introduce the framework of biresiduated multi-adjoint logic programming and sketch some considerations on its fixpoint semantics.
منابع مشابه
Biresiduated Multi-Adjoint Logic Programming
Multi-adjoint logic programs were recently proposed as a generalisation of monotonic and residuated logic programs introduced, in that simultaneous use of several implications in the rules and rather general connectives in the bodies are allowed. In this work, the possible existence of biresiduated pairs is considered, later, on the resulting framework of biresiduated multi-adjoint logic progra...
متن کاملMulti-Adjoint Logic Programming
A synthesis of results of the recently introduced paradigm of multi-adjoint logic programming is presented. These results range from a proof theory together with some (quasi)completeness results to general termination results, and from the neural-like implementation of its fix-point semantics to the more general biresiduated multi-adjoint logic programming and its relationship with other approa...
متن کاملRevisiting Reductants in the Multi-adjoint Logic Programming Framework
Reductants are a special kind of fuzzy rules which constitute an essential theoretical tool for proving correctness properties. A multi-adjoint logic program, when interpreted on an arbitrary lattice, has to include all its reductants in order to preserve the approximate completeness property. In this work, after revisiting the different notions of reductant arisen in the framework of multi-adj...
متن کاملDedekind-MacNeille Completion and Multi-adjoint Lattices
Among other applications, multi-adjoint lattices have been successfully used for modeling flexible notions of truth-degrees in the fuzzy extension of logic programming called MALP (Multi-Adjoint Logic Programming). In this paper we focus in the completion of such mathematical construct by adapting the classical notion of Dedekind-MacNeille in order to relax this usual hypothesis on such kind of...
متن کاملA Neural Approach to Abductive Multi-adjoint Reasoning
A neural approach to propositional multi-adjoint logic programming was recently introduced. In this paper we extend the neural approach to multi-adjoint deduction and, furthermore, modify it to cope with abductive multi-adjoint reasoning, where adaptations of the uncertainty factor in a knowledge base are carried out automatically so that a number of given observations can be adequately explained.
متن کامل